CORC Technical Report TR-2004-10 Ambiguous chance constrained problems and robust optimization

نویسندگان

  • E. Erdoğan
  • G. Iyengar
چکیده

In this paper we study ambiguous chance constrained problems where the distributions of the random parameters in the problem are themselves uncertain. We primarily focus on the special case where the uncertainty set Q of the distributions is of the form Q = {Q : ρp(Q, Q0) ≤ β}, where ρp denotes the Prohorov metric. The ambiguous chance constrained problem is approximated by a robust sampled problem where each constraint is a robust constraint centered at a sample drawn according to the central measure Q0. The main contribution of this paper is to show that the robust sampled problem is a good approximation for the ambiguous chance constrained problem with high probability. This result is established using the Strassen-Dudley Representation Theorem that states that when the distributions of two random variables are close in the Prohorov metric one can construct a coupling of the random variables such that the samples are close with high probability. We also show that the robust sampled problem can be solved efficiently both in theory and in practice.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CORC Technical Report TR-2005-06 On two-stage convex chance constrained problems

In this paper we develop approximation algorithms for two-stage convex chance constrained problems. Nemirovski and Shapiro [18] formulated this class of problems and proposed an ellipsoid-like iterative algorithm for the special case where the impact function f(x,h) is bi-affine. We show that this algorithm extends to bi-convex f(x,h) in a fairly straightforward fashion. The complexity of the s...

متن کامل

CORC Technical Report TR-2003-02 Inverse conic programming and applications

The past decade has seen a growing interest in inverse optimization. It has been shown that duality yields very efficient algorithms for solving inverse linear programming problems. In this paper, we consider a special class of conic programs that admits a similar duality and show that the corresponding inverse optimization problems are efficiently solvable. We discuss the applications of inver...

متن کامل

CORC Technical Report TR - 2004 - 11 Robust Active Portfolio Management ∗

In this paper we construct robust models for active portfolio management in a market with transaction costs. The goal of these robust models is to control the impact of estimation errors in the values of the market parameters on the performance of the portfolio strategy. Our models can handle a large class of piecewise convex transaction cost functions and allow one to impose additional side co...

متن کامل

CORC Technical Report TR-2002-03 Robust portfolio selection problems

In this paper we show how to formulate and solve robust portfolio selection problems. The objective of these robust formulations is to systematically combat the sensitivity of the optimal portfolio to statistical and modeling errors in the estimates of the relevant market parameters. We introduce “uncertainty structures” for the market parameters and show that the robust portfolio selection pro...

متن کامل

Ambiguous chance constrained problems and robust optimization

In this paper we study ambiguous chance constrained problems where the distributions of the random parameters in the problem are themselves uncertain. We focus primarily on the special case where the uncertainty set Q of the distributions is of the form Q = {Q : ρp(Q, Q0) ≤ β}, where ρp denotes the Prohorov metric. The ambiguous chance constrained problem is approximated by a robust sampled pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004